Computing minimum-area rectilinear convex hull and L-shape
نویسندگان
چکیده
Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano
منابع مشابه
Rectilinear and O-convex hull with minimum area
Let P be a set of n points in the plane and O be a set of k lines passing through the origin. We show: (1) How to compute the O-hull of P in Θ(n log n) time and O(n) space, (2) how to compute and maintain the rotated hull OHθ(P ) for θ ∈ [0, 2π) in O(kn log n) time and O(kn) space, and (3) how to compute in Θ(n log n) time and O(n) space a value of θ for which the rectilinear convex hull, RHθ(P...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets1
We present an eecient algorithm to compute an optimal rectilinear Steiner tree for extremal point sets. A point set is extremal if every point in it lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used to construct minimum-length connection for multi-terminal nets in homotopic routing in VLSI layout design. The previous best algorithms run in O(k 4 n) ti...
متن کاملRectilinear Convex Hull with Minimum Area
Let P be a set of n points in the plane. We solve the problem of computing the orientations for which the rectilinear convex hull of P has minimum area in optimal ⇥(n log n) time and O(n) space. Introduction The interest in the rectilinear convex hull of planar point sets arises from the study of ortho-convexity [10], a relaxation of traditional convexity. Unlike convex regions, an ortho-convex...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 42 شماره
صفحات -
تاریخ انتشار 2009